Decomposition of bipartite graphs into special subgraphs
نویسندگان
چکیده
منابع مشابه
Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
متن کاملDecompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.
متن کاملOn the cyclic decomposition of complete graphs into bipartite graphs
Let G be a graph with n edges. It is known that there exists a cyelic Gdecomposition of K 2n+1 if and only if G has a p-Iabeling. An a-labeling of G easily yields both a cyelic G-decomposition of Kn,n and of K2nx+l for all positive integers x. It is well-known that certain classes of bipartite graphs (including certain trees) do not have a-Iabelings. :Moreover, there are bipartite graphs with n...
متن کاملOn the cyclic decomposition of circulant graphs into bipartite graphs
It is known that if a bipartite graph G with n edges possesses any of three types of ordered labelings, then the complete graphK2nx+1 admits a cyclic G-decomposition for every positive integer x. We introduce variations of the ordered labelings and show that whenever a bipartite graph G admits one of these labelings, then there exists a cyclic G-decomposition of an infinite family of circulant ...
متن کاملDecomposition of Random Graphs into Complete Bipartite Graphs
We consider the problem of partitioning the edge set of a graph G into the minimum number τ(G) of edge-disjoint complete bipartite subgraphs. We show that for a random graph G in G(n, p), where p is a constant no greater than 1/2, almost surely τ(G) is between n− c(logn) and n− 2 log1/p n for any positive constants c and .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.06.011